Reshaping Access Patterns for Generating Sparse Codes
نویسندگان
چکیده
In a new approach to the development of sparse codes, the programmer de nes a particular algorithm on dense matrices which are actually sparse. The sparsity of the matrices as indicated by the programmer is only dealt with at compile-time. The compiler selects appropriate compact data structure and automatically converts the algorithm into code that takes advantage of the sparsity of the matrices. In order to achieve e cient sparse codes, the compiler must be able to reshape some access patterns before a data structure is selected. In this paper, we discuss a reshaping method that is based on unimodular transformations.
منابع مشابه
Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices
In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the lite...
متن کاملSPARK00: A Benchmark Package for the Compiler Evaluation of Irregular/Sparse Codes
We propose a set of benchmarks that specifically targets a major cause of performance degradation in high performance computing platforms: irregular access patterns. These benchmarks are meant to be used to asses the performance of optimizing compilers on codes with a varying degree of irregular access. The irregularity caused by the use of pointers and indirection arrays are a major challenge ...
متن کاملMultilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes
The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.
متن کاملReshaping Access Patterns for Improving Data Locality
In this paper, we present a method to construct a loop transformation that simultaneously reshapes the access patterns of several occurrences of multidimensional arrays along certain desired access directions. First, the method determines a direction through the original iteration space along which these desired access directions are induced. Subsequently, a unimodular transformation is constru...
متن کاملModeling Set Associative Caches Behaviour for Irregular Computations
While much work has been devoted to the study of cache behavior during the execution of codes with regular access patterns, little attention has been paid to irregular codes. An important portion of these codes are scientiic applications that handle compressed sparse matrices. In this work a probabilistic model for the prediction of the number of misses on a K-way associative cache memory consi...
متن کامل